Restricted power domination and zero forcing problems
نویسندگان
چکیده
منابع مشابه
Restricted power domination and fault-tolerant power domination on grids
The power domination problem is to find a minimum placement of phase measurement units (PMUs) for observing the whole electric power system, which is closely related to the classical domination problem in graphs. For a graph G = (V , E), the power domination number of G is the minimum cardinality of a set S ⊆ V such that PMUs placed on every vertex of S results in all of V being observed. A ver...
متن کاملZero forcing parameters and minimum rank problems
Abstract. The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a 1 graph G, is used to study the maximum nullity/minimum rank of the family of symmetric matrices described by 2 G. It is shown that for a connected graph of order at least two, no vertex is in every zero forcing set. The positive 3 semidefinite zero forcing number Z+(G) is introduced, and ...
متن کاملComputational Approaches for Zero Forcing and Related Problems
In this paper, we propose computational approaches for the zero forcing problem, the connected zero forcing problem, and the problem of forcing a graph within a specified number of timesteps. Our approaches are based on a combination of integer programming models and combinatorial algorithms, and include formulations for zero forcing as a dynamic process, and as a set-covering problem. We explo...
متن کاملOn the zero forcing number of some Cayley graphs
Let Γa be a graph whose each vertex is colored either white or black. If u is a black vertex of Γ such that exactly one neighbor v of u is white, then u changes the color of v to black. A zero forcing set for a Γ graph is a subset of vertices Zsubseteq V(Γ) such that if initially the vertices in Z are colored black and the remaining vertices are colored white, then Z changes the col...
متن کاملRestricted domination parameters in graphs
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V (G) is an m-tuple dominating set if S dominates every vertex of G at least m times, and an m-dominating set if S dominates every vertex of G−S at least m times. The minimum cardinality of a dominating set is γ, of an m-dominating set is γm, and of an m-tuple dominating set is γ×m. For a property π of subsets of V (G), wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2018
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-018-0330-6